Convergence Analysis of All-at-Once Multigrid Methods for Elliptic Control Problems under Partial Elliptic Regularity
نویسندگان
چکیده
In this paper we consider the convergence theory for an all-at-once multigrid method for a distributed optimal control problem. Such an analysis has been recently done, see [11]. Here, we give a new proof which is based on a more straight-forward approach. The main benefit of this new approach is the possibility to extend the analysis to domains where full elliptic regularity, i.e., H2-regularity for the Poisson problem, cannot be guaranteed.
منابع مشابه
A Robust Multigrid Method for Elliptic Optimal Control Problems
We consider the discretized optimality system of a special class of elliptic optimal control problems and propose an all-at-once multigrid method for solving this discretized system. Under standard assumptions the convergence of the multigrid method and the robustness of the convergence rates with respect to the involved parameter are shown. Numerical experiments are presented for illustrating ...
متن کاملNew Nonlinear Multigrid Analysis
SUMMARY The nonlinear multigrid is an eecient algorithm for solving the system of nonlinear equations arising from the numerical discretization of nonlinear elliptic boundary problems 7],,9]. In this paper, we present a new nonlinear multigrid analysis as an extension of the linear multigrid theory presented by Bramble, et al. in 5], 6], and 17]. In particular, we prove the convergence of the n...
متن کاملConvergence of nonconforming multigrid methods without full elliptic regularity
We consider nonconforming multigrid methods for symmetric positive definite second and fourth order elliptic boundary value problems which do not have full elliptic regularity. We prove that there is a bound (< 1) for the contraction number of the W -cycle algorithm which is independent of mesh level, provided that the number of smoothing steps is sufficiently large. We also show that the symme...
متن کاملConvergence of the multigrid V-cycle algorithm for second-order boundary value problems without full elliptic regularity
The multigrid V -cycle algorithm using the Richardson relaxation scheme as the smoother is studied in this paper. For second-order elliptic boundary value problems, the contraction number of the V -cycle algorithm is shown to improve uniformly with the increase of the number of smoothing steps, without assuming full elliptic regularity. As a consequence, the V -cycle convergence result of Braes...
متن کاملMultigrid Methods for Discrete Elliptic Problems on Triangular Surfaces
We construct and analyze multigrid methods for discretized selfadjoint elliptic problems on triangular surfaces in R3. The methods involve the same weights for restriction and prolongation as in the case of planar triangulations and therefore are easy to implement. We prove logarithmic bounds of the convergence rates with constants solely depending on the ellipticity, the smoothers and on the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 51 شماره
صفحات -
تاریخ انتشار 2013